Set-based Nondeterministic Declarative Programming in Singleton
نویسندگان
چکیده
منابع مشابه
Answer Set Programming and Declarative Problem Solving in Game AIs
Designing and implementing AI in games is an interesting, yet complex task. This paper briefly presents some applications that make use of Answer Set Programming for such a task, and show some advantages of declarative programming frameworks against imperative (algorithmic) approaches while dealing with knowledge representation and reasoning: solid theoretical bases, no need for algorithm desig...
متن کاملDeclarative Rule-Based Constraint Programming
The focus of this research is on the area of declarative rulebased constraint programming, in particular on answer set programming. Answer set programming (ASP) is an approach to rule-based constraint programming that has received increasing attention over the last few years. Rulebased programming seems like a natural way to represent specifications for several problems. The aim is to develop a...
متن کاملDeclarative Query Tuning and Optimization using Answer Set Programming
In [2, Chapter 14], Lewis describes the basics behind the procedure used by the oracle query optimizer for computing the optimal join order for a sample query. Given a set T of n pairs table:cost, a join order is a full binary tree such that (i) T is the set of its leaves, (ii) the right child of an inner node is a leaf, and (iii) each inner node is a pair join tag:cost where join tag is either...
متن کاملDeclarative Programming in Prolog
We try to assess to what extent declarative programming can be realized in Prolog and which aspects of correctness of Prolog programs can be dealt with by means of declarative interpretation. More specifically, we discuss termination of Prolog programs, partial correctness, absence of errors and the safe use of negation.
متن کاملSaul: Towards Declarative Learning Based Programming
We present Saul, a new probabilistic programming language designed to address some of the shortcomings of programming languages that aim at advancing and simplifying the development of AI systems. Such languages need to interact with messy, naturally occurring data, to allow a programmer to specify what needs to be done at an appropriate level of abstraction rather than at the data level, to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80795-3